Generalized balances in Sturmian words
نویسندگان
چکیده
منابع مشابه
Generalized balances in Sturmian words
One of the numerous characterizations of Sturmian words is based on the notion of balance. An innnite word x on the f0;1g alphabet is balanced if, given two factors of x, w and w 0 , having the same length, the diierence between the number of 0 0 s in w (denoted by jwj0) and the number of 0 0 s in w 0 is at most 1, i.e. jjwj0 ? jw 0 j0j 1. It is well known that an aperiodic word is Sturmian if ...
متن کاملPalindromes in Sturmian Words
We study some structural and combinatorial properties of Sturmian palindromes, i.e., palindromic finite factors of Sturmian words. In particular, we give a formula which permits to compute in an exact way the number of Sturmian palindromes of any length. Moreover, an interesting characterization of Sturmian palindromes is obtained.
متن کاملReturn words in Sturmian and episturmian words
Considering each occurrence of a word w in a recurrent infinite word, we define the set of return words of w to be the set of all distinct words beginning with an occurrence of w and ending exactly just before the next occurrence of w in the infinite word. We give a simpler proof of the recent result (of the second author) that an infinite word is Sturmian if and only if each of its factors has...
متن کاملAbelian Repetitions in Sturmian Words
We investigate abelian repetitions in Sturmian words. We exploit a bijection between factors of Sturmian words and subintervals of the unitary segment that allows us to study the periods of abelian repetitions by using classical results of elementary Number Theory. If km denotes the maximal exponent of an abelian repetition of period m, we prove that lim sup km/m ≥ √ 5 for any Sturmian word, an...
متن کاملAbelian returns in Sturmian words
Return words constitute a powerful tool for studying symbolic dynamical systems. They may be regarded as a discrete analogue of the first return map in dynamical systems. In this paper we investigate two abelian variants of the notion of return word, each of them gives rise to a new characterization of Sturmian words. We prove that a recurrent infinite word is Sturmian if and only if each of it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2002
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(01)00247-5